3,347 research outputs found
Essential spectra and exponential estimates of eigenfunctions of lattice operators of quantum mechanics
This paper is devoted to estimates of the exponential decay of eigenfunctions
of difference operators on the lattice Z^n which are discrete analogs of the
Schr\"{o}dinger, Dirac and square-root Klein-Gordon operators. Our
investigation of the essential spectra and the exponential decay of
eigenfunctions of the discrete spectra is based on the calculus of so-called
pseudodifference operators (i.e., pseudodifferential operators on the group
Z^n) with analytic symbols and on the limit operators method. We obtain a
description of the location of the essential spectra and estimates of the
eigenfunctions of the discrete spectra of the main lattice operators of quantum
mechanics, namely: matrix Schr\"{o}dinger operators on Z^n, Dirac operators on
Z^3, and square root Klein-Gordon operators on Z^n
LOS UNITARIOS. FACCIONALISMO, PRÁCTICAS, CONSTRUCCIÓN IDENTITARIA Y VÍNCULOS DE UNA AGRUPACIÓN POLÍTICA DECIMONÓNICA, 1820-1852
Ignacio Zubizarreta, Los Unitarios. Faccionalismo, prácticas, construcción identitaria y vínculos de una agrupación política decimonónica, 1820-1852, Stuttgart, Verlag Hans-Dieter Heinz, 2012, 324 pp
Distribution of Mutual Information
The mutual information of two random variables i and j with joint
probabilities t_ij is commonly used in learning Bayesian nets as well as in
many other fields. The chances t_ij are usually estimated by the empirical
sampling frequency n_ij/n leading to a point estimate I(n_ij/n) for the mutual
information. To answer questions like "is I(n_ij/n) consistent with zero?" or
"what is the probability that the true mutual information is much larger than
the point estimate?" one has to go beyond the point estimate. In the Bayesian
framework one can answer these questions by utilizing a (second order) prior
distribution p(t) comprising prior information about t. From the prior p(t) one
can compute the posterior p(t|n), from which the distribution p(I|n) of the
mutual information can be calculated. We derive reliable and quickly computable
approximations for p(I|n). We concentrate on the mean, variance, skewness, and
kurtosis, and non-informative priors. For the mean we also give an exact
expression. Numerical issues and the range of validity are discussed.Comment: 8 page
Localizations at infinity and essential spectrum of quantum Hamiltonians: I. General theory
We isolate a large class of self-adjoint operators H whose essential spectrum
is determined by their behavior at large x and we give a canonical
representation of their essential spectrum in terms of spectra of limits at
infinity of translations of H. The configuration space is an arbitrary abelian
locally compact not compact group.Comment: 63 pages. This is the published version with several correction
Generation linewidth of an auto-oscillator with a nonlinear frequency shift: Spin-torque nano-oscillator
It is shown that the generation linewidth of an auto-oscillator with a
nonlinear frequency shift (i.e. an auto-oscillator in which frequency depends
on the oscillation amplitude) is substantially larger than the linewidth of a
conventional quasi-linear auto-oscillator due to the renormalization of the
phase noise caused by the nonlinearity of the oscillation frequency. The
developed theory, when applied to a spin-torque nano-contact auto-oscillator,
predicts a minimum of the generation linewidth when the nano-contact is
magnetized at a critical angle to its plane, corresponding to the minimum
nonlinear frequency shift, in good agreement with recent experiments.Comment: 4 pages, 2 figure
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal
logic is expressively equivalent over the class of ordinals to first-order
logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability
problem over the class of ordinals. Among the consequences of our proof, we
show that given the code of some countable ordinal alpha and a formula, we can
decide in PSPACE whether the formula has a model over alpha. In order to show
these results, we introduce a class of simple ordinal automata, as expressive
as B\"uchi ordinal automata. The PSPACE upper bound for the satisfiability
problem of the temporal logic is obtained through a reduction to the
nonemptiness problem for the simple ordinal automata.Comment: Accepted for publication in LMC
Dynamical Encoding by Networks of Competing Neuron Groups: Winnerless Competition
Following studies of olfactory processing in insects and fish, we investigate neural networks whose dynamics in phase space is represented by orbits near the heteroclinic connections between saddle regions (fixed points or limit cycles). These networks encode input information as trajectories along the heteroclinic connections. If there are N neurons in the network, the capacity is approximately e(N-1)!, i.e., much larger than that of most traditional network structures. We show that a small winnerless competition network composed of FitzHugh-Nagumo spiking neurons efficiently transforms input information into a spatiotemporal output
- …